Some Improved Inclusion Methods for Polynomial Roots with Weierstrass' Corrections

نویسندگان

  • MIODRAG S. PETKOVIC
  • C. CARSTENSEN
چکیده

1. I N T R O D U C T I O N Let P be a monic complex polynomial of degree n >_ 3 with simple zeros (1 , . . , (,, and let Zl , . . . , z , be distinct approximations of these zeros. Then an arbitrary zero can be expressed by (j zj _ ,,WJ , ( j 1,. . . , n) (1) 1 w k=l,k~j (see [3,4]), where = . P(z ) (2) k= l ,k#j is the so-called Weierstrass' correction [5]. Suppose that we have found disjoint disks ZI , . . . , Z~ in the complex plane such that (j E Zj for any j E {1 , . . . , n}. Starting from the fixed-point relation (1) and using circular complex arithmetic Petkovi~ stated in [1] the third order method for the simultaneous inclusion of all zeros of P, Zj = zj , Wj , (i = 1, . . . , n), (3) 1 w k=l ,kCj where Zj denotes the new circular approximation for (j. Considering the fixed-point relation (1), we observe that the exact zero ~j on the right-hand side can be substituted by the Weierstrass' approximation zj Wj. In this way, we obtain the fourth order method in ordinary complex arithmetic, ~j = zj _ , Wj , (j = 1, . . . , n) (4) 1 w. k= 1,k:~j zk-zj+Wj Typeset by . ~ T ~

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On iteration methods without derivatives for the simultaneous determination of polynomial zeros

Carstensen, C. and M.S. PetkoviC, On iteration methods without derivatives for the simultaneous determination of polynomial zeros, Journal of Computational and Applied Mathematics 45 (1993) 251-266. Several algorithms for simultaneously approximating simple complex zeros of a polynomial are presented. These algorithms use Weierstrass’ corrections and do not require any polynomial derivatives. I...

متن کامل

On the Divergent Properties of Two–sided Sor Weierstrass Method

In this paper the convergence properties of the two-side successive over-relaxation (TSSOR) method of Weierstrass’ type is discussed. Initial conditions under which this method is divergent are stated. The main theorem generalizes some recent results concerning divergent properties of simultaneous methods for finding polynomial zeros. Let f(x) = x + an−1xn−1 + · · ·+ a1x+ a0 be a monic polynomi...

متن کامل

Euler-like Method for the Simultaneous Inclusion of Polynomial Zeros with Weierstrass’ Correction

An improved iterative method of Euler’s type for the simultaneous inclusion of polynomial zeros is considered. To accelerate the convergence of the basic method of fourth order, Carstensen-Petković’s approach [7] using Weierstrass’ correction is applied. It is proved that the R-order of convergence of the improved Euler-like method is (asymptotically) 2 + √ 7 ≈ 4.646 or 5, depending of the type...

متن کامل

TR-2002003: Univariate Polynomial Root-Finding with a Lower Computational Precision and Higher Convergence Rates

Univariate polynoimial rootnding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. The Weierstrass (Durand{Kerner) approach and its variations are most popular practical choices for simultaneous approximation of all roots of a polynomial, but these methods require computations with a high multiple precision. We a...

متن کامل

Improved Higher Order Method for the Inclusion of Multiple Zeros of Polynomials∗

Starting from a suitable fixed point relation and employing Schröder’s and Halley-like corrections, we derive some high order iterative methods for the simultaneous inclusion of polynomial multiple zeros in circular complex interval arithmetic. These methods are more efficient compared to the existing inclusion methods based on fixed point relations. Using the concept of the R-order of converge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002